Method and apparatus for encoding and decoding data

ABSTRACT

A deterministic structure for controlled distribution of weight-2 columns is proposed for a parity-check matrix H that reduces the occurrence of undetected frame errors and significantly enhances the code performance in comparison to a randomly-constructed parity-check matrix. H comprises a non-deterministic section H 1  and a deterministic section H 2 , and wherein H 2  comprises a first part comprising a column h having an odd weight greater than 2, and a second part comprising matrix elements for row i, column j equal to
         1 for i=j,   1 for i=j+1,   0 elsewhere.

FIELD OF THE INVENTION

The present invention relates generally to encoding and decoding data and in particular, to a method and apparatus for encoding and decoding data utilizing low-density parity-check (LDPC) codes.

BACKGROUND OF THE INVENTION

An LDPC code is a linear block code specified by a parity-check matrix H. In general, an LDPC code is defined over a Galois Field GF(q), q≧2. If q=2, the code is a binary code. As with all linear block codes, a k-bit information block s_(1×k) is generally encoded by the code generator matrix G_(k×n) to become an n-bit codeword x_(1×n), and the code rate is r=k/n. The codeword x is transmitted through a noisy channel, and the received signal vector y is passed to the decoder to estimate the information block s_(1×k).

Given an n-dimensional space, the rows of G span the k-dimensional codeword subspace C, and the rows of the parity-check matrix H_(m×n) span the m-dimensional dual space C^(⊥), where m=n−k. Since x=sG and GH^(T)=0, it follows that xH^(T)=0 for all codewords in subspace C, where “T” denotes matrix transpose. In the discussion of LDPC codes, this is generally written as Hx^(T)=0^(T)  , (1) where 0 is a row vector of all zeros, and the codeword x=[s p]=[s₀, s₁, . . . , s_(k−1), p₀, p₁, . . . , p_(m−1)], where p₀, . . . p_(m−1) are the parity-check bits; and s₀, . . . s_(k−1) are the systematic bits, equal to the information bits within the information block.

In order to use an LDPC code with good error-correcting performance, an appropriate low-density parity-check matrix H has to be defined. For most irregular LDPC codes, this requires making a large portion of the columns of H to be weight-2 (i.e., two ones and all zeros in a column) in order to keep the overall density low (i.e., the overall matrix should be sparse). This large number of weight-2 columns can allow high weights (e.g., 30) to be assigned to some columns while still maintaining a low average column weight in H. (Note that the row weights are usually limited in range and are relatively small. )

Designing a parity-check matrix with various row and column weights is complicated when error performance is considered. For example, a matrix can be constructed with a series of randomly generated columns while satisfying the row weight and column weight constraints, however, with a large percentage of weight-2 columns in the matrix, randomly-generated weight-2 columns can easily contain a bad structure which induces an undetectable error event and a low minimum distance. In general, an undetectable error event of N_(ud) bits could happen if N_(ud) columns of the parity-check matrix sum (modulo 2) to the all-zero column. The all-zero column summation occurs with higher frequency when the parity-check matrix has a small size and contains weight-2 columns. The undetectable error event is directly linked to the minimum distance of the code which is equal to min(N_(ud)). As a result, a randomly-generated parity-check matrix can have a small minimum distance, which causes a high probability of undetectable errors and an error floor at high signal-to-noise ratios. Furthermore, since code bits (elements of x) associated with weight-2 columns are much more prone to errors than code bits associated with higher-weight columns, a large percentage of undetectable frame errors is expected to involve weight-2 columns. Although there are several prior-art code construction guidelines cited or implied in literature such as (a) avoiding cycles of length 4 and (b) avoiding overlap between weight-2 columns when possible, these guidelines may not be sufficient for good error performance codes. Therefore, there is a need for deterministic distribution of weight-2 columns in which the occurrence of undetected frame errors is reduced in order to significantly enhance code performance in comparison to a randomly-constructed parity-check matrix.

Notwithstanding the above problem, another issue of LDPC codes is the high encoding complexity of the straightforward method using the generator matrix G corresponding to the H matrix defining the code. For a systematic LDPC encoder, parity-check bit p_(i), i=0, . . . , m−1, is generally computed from the given information bits, s₀, . . . , s_(k−1), m=n−k. Letting the codeword be x=[s p]=[s₀, s₁, . . . , s_(k−1), p₀, p₁, . . . , p_(m−1)], the parity-check bits satisfy the parity-check equations of (1). A conventional encoding method transforms the parity-check matrix H into a systematic form H_(sys)=[I_(m×m), P^(T)] through Gaussian elimination and column reordering so that the corresponding code generator matrix is G=[P_(k×m), I_(k×k)]. Therefore, the conventional encoder calculates the parity-check bits using [p₀, . . . , p_(m−1)]=[s₀, . . . , s_(k−1)]P.

This straightforward method can cause implementation problems especially when the codeword size n is large. First, although H has low density (i.e., with a few 1's in the matrix and the number of 1's per row not growing with n), P and hence G usually have high density (i.e., many 1's in the matrix and the number of 1's per row increasing as n increases). Implementing the conventional encoder can require a large amount of memory to store the positions of the 1's in P. Secondly, due to the high density of P, the number of binary additions (only counting the terms when the elements of P are ‘1’) is on the order of n²; implying that the encoding complexity grows quadratically with n. Therefore, there is a need for an efficient encoder for irregular LDPC codes that takes advantage of the structure of a good performing irregular LDPC code to minimize preprocessing and admit a simple encoding program.

BRIEF DESCRIPTION OF THE DRAWINGS

FIG. 1 is a block diagram of an encoder in accordance with the preferred embodiment of the present invention.

FIG. 2 is a block diagram of a decoder in accordance with the preferred embodiment of the present invention.

FIG. 3 is a flow chart showing the operation of the encoder of FIG. 1 in accordance with the preferred embodiment of the present invention.

FIG. 4 is a flow chart showing operation of the decoder of FIG. 2 in accordance with the preferred embodiment of the present invention.

DETAILED DESCRIPTION OF THE DRAWINGS

To address the above-mentioned needs, a method and apparatus for encoding and decoding data is provided herein. In particular, parity-check bits are provided that are generated via a parity-check matrix H that reduces the occurrence of undetected frame errors and significantly enhances the code performance in comparison to a randomly-constructed parity-check matrix. H comprises a non-deterministic section H₁ and a deterministic section H₂, and wherein H₂ comprises a first part comprising a column h having an odd weight greater than 2, and a second part comprising matrix elements for row i, column j equal to 1 for i=j, 1 for i=j+1, 0 elsewhere.

The present invention encompasses a method for operating a transmitter that generates parity-check bits (p₀, . . . , p_(m−1)) based on a current symbol set s=(s₀, . . . , s_(k−1)). The method comprises the steps of receiving the current symbol set s=(s₀, . . . , s_(k−1)), and using a matrix H to determine the parity-check bits. H comprises a non-deterministic section H₁ an d a deterministic section H₂, and wherein H₂ comprises a first part comprising a column h having an odd weight greater than 2, and a second part comprising matrix elements for row i, column j equal to 1 for i=j, 1 for i=j+1, 0 elsewhere.

The present invention additionally encompasses a method for operating a receiver that estimates a current symbol set s=(s₀, . . . , s_(k−1)). The method comprises the steps of receiving a received signal vector y=(y₀ . . . y_(n−1)) and using matrix H to estimate the current symbol set (s₀, . . . , s_(k−1)).

The present invention additionally encompasses an apparatus comprising storage means for storing the matrix H and a microprocessor using a matrix H to determine parity-check bits.

The present invention additionally encompasses an apparatus comprising storage means for storing matrix H, a receiver for receiving a signal vector y=(y₀ . . . y_(n−1)), and a microprocessor using a matrix H to determine a current symbol set (s₀, . . . , s_(k−1)).

Turning now to the drawings, wherein like numerals designate like components, FIG. 1 is a block diagram of encoder 100 in accordance with a first embodiment of the present invention. As shown, encoder 100 comprises microprocessor 101 and lookup table 103. In the first embodiment of the present invention microprocessor 101 comprises a digital signal processor (DSP), such as, but not limited to MSC8100 and DSP56300 DSPs. Additionally, lookup table 103 serves as storage means to store a matrix, and comprises read-only memory, however, one of ordinary skill in the art will recognize that other forms of memory (e.g., random-access memory, magnetic storage memory, etc.) may be utilized as well. In a second embodiment, the functionality of the microprocessor 101 and the lookup table 103 can be incorporated into an application specific integrated circuit (ASIC) or field programmable gate array (FPGA). In particular, the lookup table 103 can be implemented in a form of memory corresponding to the existence or non-existence of signal paths in a circuit.

As discussed above, encoded data is generally output as a plurality of parity-check bits in addition to the systematic bits, where together the parity-check and systematic bits are a solution to Hx^(T)=0^(T). In the first embodiment of the present invention a parity-check matrix H is stored in lookup table 103, and is accessed by microprocessor 101 to solve the above equation. In particular, microprocessor 101 determines appropriate values for the parity-check bits (p₀, . . . , p_(m−1)) based on the current symbol set s=(s₀, . . . , s_(k−1)) and the parity-check matrix H. The parity-check bits and the symbol set is then passed to a transmitter transmitted to a receiver. H comprises a non-deterministic section H₁ (i.e., the value of each entry is not defined or determined to have a particular structure, and therefore can be random as long as certain design constraints are met) and a deterministic section H₂, (i.e., the value of each entry is defined or determined to have a particular structure).

The deterministic section H₂ is further composed of two parts. In particular, a first part comprises a first column h having an odd weight greater than 2, the second part H′₂ comprises matrix elements equal to a 1 for i=j and a 1 for i=j+1, and a 0 elsewhere, for row i, column j of H′₂, 0≦i≦m−1, 0≦j≦m−2. Thus, the overall parity-check matrix H can be represented by H=[H₁H₂],  (2) and the deterministic section H₂ can be represented by

$\begin{matrix} \begin{matrix} {H_{2} = \begin{bmatrix} h & H_{2}^{\prime} \end{bmatrix}} \\ {= {\begin{bmatrix} h_{0} & \vdots & 1 & \; & \; & \; & \; & \; & \; & \; & \; & \; & \; \\ h_{1} & \vdots & 1 & 1 & \; & \; & \; & \; & \; & \; & \; & \; & \; \\  \cdot & \vdots & \; & 1 & 1 & \; & \; & \; & 0 & \; & \; & \; & \; \\  \cdot & \vdots & \; & \; & 1 & 1 & \; & \; & \; & \; & \; & \; & \; \\  \cdot & \vdots & \; & \; & \; & 1 & 1 & \; & \; & \; & \; & \; & \; \\  \cdot & \vdots & \; & \; & \; & \; & 1 & 1 & \; & \; & \; & \; & \; \\  \cdot & \vdots & \; & \; & 0 & \; & \; & 1 & 1 & \; & \; & \; & \; \\  \cdot & \vdots & \; & \; & \; & \; & \; & \; & 1 & 1 & \; & \; & \; \\  \cdot & \vdots & \; & \; & \; & \; & \; & \; & \; & ⋰ & ⋰ & \; & \; \\ \; & \vdots & \; & \; & \; & \; & \; & \; & \; & \; & 1 & 1 & \; \\  \cdot & \vdots & \; & \; & \; & \; & \; & \; & \; & \; & \; & 1 & 1 \\ h_{m - 1} & \vdots & \; & \; & \; & \; & \; & \; & \; & \; & \; & \; & 1 \end{bmatrix}.}} \end{matrix} & (3) \end{matrix}$

In the preferred embodiment of the present invention H₁ can be any binary matrix of size m-by-k. (In other words, H₁ can be regular or irregular or have any desired weight distribution.) While H₂ is not lower triangular, it does have a simple structure. The first column of H₂ (denoted h) has an odd number of 1's (3 or more ones), and the rest of the columns (denoted by the m-by-(m−1) matrix H′₂) are weight-2 with a maximum of 1 overlap between each other. (The prime in H′₂ indicates a sub-matrix, not a transpose.)

Although the deterministic sub-matrix H₂ always has (m−1) weight-2 columns, it is not expected to affect code performance, since there are no cycles between the weight-2 columns, and the optimal weight distributions reported in. the literature generally include a large percentage of weight-2 columns. It is expected that the H₁ sub-matrix and the h column will be designed such that the entire matrix H has good error-correcting performance. For example, H₁ is typically composed of columns with weight higher than 2.

Unlike the prior art, the H₂ matrix is chosen to avoid any weight-1 column. A weight-1 column can degrade performance since a bit corresponding to a weight-1 column does not update the soft information during iterative decoding. The deterministic sub-matrix H₂ is designed to correspond to the parity-check bits instead of the systematic bits, so that the systematic bits are better protected due to the higher column weights in H₁.

Encoding Method

The H₂ structure exemplified above makes the encoding complexity linear, instead of quadratic, in code size. Encoding can be achieved without finding or computing a generator matrix.

Given any block of information bits s, the m parity-check bits can be found by solving the equations defined by

$\begin{matrix} {{\begin{bmatrix} \left( H_{1} \right)_{m \times k} & h_{m \times 1} & \left( H_{2}^{\prime} \right)_{m \times {({m - 1})}} \end{bmatrix}\begin{bmatrix} s^{T} \\ p^{T} \end{bmatrix}} = 0.} & (4) \end{matrix}$ Due to the odd column weight of h and the m−1 weight-2 columns of H′₂, the summation of all the equation in (4) yields

$\begin{matrix} {{p_{0} = {\left( {\sum\limits_{row}H_{1}} \right)s^{T}}},} & (5) \end{matrix}$ where

$\sum\limits_{row}H_{1}$ denotes the row vector after summing up all rows of H₁. Note that the summation can equivalently be performed on the intermediate column vector v=[v₀, v₁, . . . , v_(m−1)]^(T)=H₁s^(T), but performing the summation on the rows of H₁ can be done beforehand and results in fewer operations to compute p₀.

With p₀ determined, the rest of parity-check bits, p₁ through p_(m−1) can be found recursively. For example, p ₁ =h ₀ p ₀ +v ₀, p ₂ =h ₁ p ₀ +p ₁ +v ₁, p ₃ =h ₂ p ₀ +p ₂ +v ₂, p _(m−1) =h _(m−2) p ₀ +p _(m−2) +v _(m−2),   (6) where [h₀, h₁, . . . , h_(m−2), h_(m−1)]^(T) is the column h in (3). Since all the variables are binary in (6), the encoding complexity is very low. Further, to simplify implementation, a vector w=[w₀, w₁, . . . , w_(m−2), w⁻¹]=[h₀ p₀+v₀, h₁ p₀+v₁, . . . , h_(m−2) p₀+v_(m−2), h_(m−1) p₀+v_(m−1)] can be stored so that the parity-check bits are found by p₁=w₀, p_(i)=p_(i−1)+w_(i−1), i=2, 3, . . . m−1.

The parity-check equations can also be recursively solved from p_(m−1) through p₁. In this case, the parity-check bits are found by p_(m−1)=w_(m−1), p_(i)=p_(i+1)+w_(i), i=m−2, . . . , 2,1.

Additional structure in h can be used to further reduce encoding complexity. For example, in (3) most entries of h may be the trailing zeros (e.g., h=[1 0 0 1 0 0 1 0 . . . 0]^(T)). Knowing that all values of h_(i) are 0 for z≦i≦m−1 can simplify the step of determining the parity-check bits recursively, as in (6), allowing variations of the recursive encoding structure. In one example, w_(i)=v_(i) for z≦i≦m−1, thus p_(i), z≦i≦m−1, can be found before finding p₀. Then p₀ through p_(z−1) can be found based on s and p_(z).

Decoding Method

FIG. 2 is a block diagram of decoder 200 in accordance with one embodiment of the present invention. As shown, decoder 200 comprises microprocessor 201 and lookup table 203. In a first embodiment of the present invention microprocessor 201 comprises a digital signal processor (DSP), such as, but not limited to MSC8100 and DSP56300 DSPs. Additionally, lookup table 203 acts as storage means for storing matrix H, and comprises read-only memory: However, one of ordinary skill in the art will recognize that other forms of memory (e.g., random-access memory, magnetic storage memory, etc.) may be utilized as well. In a second embodiment, the functionality of the microprocessor 201 and the lookup table 203 can be incorporated into an application specific integrated circuit (ASIC) or field programmable gate array (FPGA). In particular, the lookup table 203 can be implemented in a form of memory corresponding to the existence or non-existence of signal paths in a circuit.

The received signal vector (received via a receiver) y=(y₀ . . . y_(n−1)) corresponds to the codeword x transmitted through a noisy channel, where the encoded data x, as discussed above, is a solution to Hx^(T)=0^(T). In the first embodiment of the present invention a parity-check matrix H is stored in lookup table 203, and is accessed by microprocessor 201 to decode y and estimate the information block s (i.e., the current symbol set (s₀, . . . , s_(k−1))). In particular, microprocessor 201 estimates the current symbol set (s₀, . . . , s_(k−1)) based on the received signal vector y=(y₀. . . y_(n−1)) and the parity-check matrix H. As discussed above, H comprises a non-deterministic section H₁ (i.e., the value of each entry is not defined or determined to have a particular structure, and therefore can be random as long as certain design constraints are met) and a deterministic section H₂, (i.e., the value of each entry is defined or determined to have a particular structure).

As is well known in the art, there are many ways the decoder 200 can use the parity-check matrix H in the microprocessor 201 for decoding. One such way is to perform a vector-matrix multiplication with H to determine a likely error pattern. Another such way is to use H to construct a bipartite graph where the edges in the graph correspond to the 1's in H, and to iteratively process y on the bipartite graph.

Code Modification

It is often desirable to create a new code (a new or different parity-check matrix) by modifying an existing code (an existing parity-check matrix). The new code typically has a different number of information or parity-check bits than the existing code. If the modifications are appropriate, the new code can be encoded and decoded via a similar procedure as the original code. Modifications of adding or removing parity-check bits are especially difficult for LDPC codes because the resulting code may not have good properties for encoding or decoding even if the original code had good properties. The following sub-sections describe two ways of modifying the codes that maintain the good properties of the code.

Simple Modification

With the H₂ structure described above, the H matrix can be expanded or shrunk by an arbitrary number of parity-check bits without changing the structure of H₂. Each expanded or shrunk code uses the same encoding procedure illustrated above, and maintains good performance when its H₁ sub-matrix is constructed carefully.

For example, if g parity-check bits are to be punctured to achieve a higher-rate (n−g, k) code, the H matrix is modified by removing g right-most columns and g lowest rows. Alternatively, the H matrix can be extended by g parity-check bits to achieve a lower-rate (n+g, k) code by adding g columns on the right and g rows on the bottom, maintaining the diagonal weight-2 column structure in H₂.

To avoid having a undesirable first column (e.g., weight lower than 3, or even weight) in H₂ when puncturing, the structure, where the 1's of h are distributed towards the top, is preferred. For example, in (3) with h=[1 0 0 1 0 0 1 0 . . . 0]^(T), only 3 entries of h are 1 and are located towards the top of h.

While simple modification retains the ease of encoding of the original code, and promotes a reduction in memory for storing matrices, codes created by simple modification are not related in the sense that the parity-check bits of the higher rate code are a subset of the lower rate code's parity-check bits. The relationship where the parity-check bits of the higher rate code are a subset of the lower rate code's parity-check bits given the same information symbol set is called rate compatibility.

Rate-Compatible Code Modification

The H matrix defined above can be modified to create rate-compatible LDPC codes by concatenating portions similar to H₂. For example, consider three codes, where the superscript indicates code 1, code 2, and code 3, respectively. The parity-check bits of code 1 are a subset of the parity-check bits of code 2 (i.e., the parity-check bits of code 1 are nested within the parity-check bits of code 2), and the parity-check bits of code 2 are a subset of the parity-check bits of code 3 (i.e., the parity-check bits of code 2 are nested within the parity-check bits of code 3, and in turn the parity bits of code 1 are nested within the parity bits of code 3). Code 1 has a parity-check matrix H⁽¹⁾ defined by H⁽¹⁾=[H₁ ⁽¹⁾H₂ ⁽¹⁾],  (7) where H₁ ⁽¹⁾ is an m₁-by-k matrix and H₂ ⁽¹⁾ is an m₁-by-m₁ matrix whose structure can follow (3), and produces parity-check bits p₀, p₁, . . . , p_(m) ₁ ⁻¹. Note that (7) is equivalent to (2), and the superscripts “(1)” are just used to emphasize the first code (i.e., H⁽¹⁾=H, m₁=m).

Code 2 has a parity-check matrix H⁽²⁾ defined by

$\begin{matrix} {{H^{(2)} = \begin{bmatrix} \begin{matrix} H_{1}^{(1)} & H_{2}^{(1)} \end{matrix} & 0 \\ H_{1}^{(2)} & H_{2}^{(2)} \end{bmatrix}},} & (8) \end{matrix}$ where H₁ ⁽²⁾ is an (m₂−m₁)-by-(k+m₁) matrix, H₂ ⁽²⁾ is an (m₂−m₁)-by-(m₂−m₁) matrix whose structure can follow that set forth in equation (3), and code 2 produces parity-check bits p₀, p₁, . . . , p_(m) ₂ ⁻¹. As it follows the structure set forth in (3), the deterministic section H₂ ⁽²⁾ has a first column h⁽²⁾ having an odd weight greater than 2, and a second part comprising a 1 for i=j and a 1 for i=j+1, and 0 elsewhere, for row i, column j, 0≦i≦m−1, 0≦j≦m−2. The first column h⁽²⁾ does not have to have the same size or composition as h⁽¹⁾, which is the column h from code 1. Due to the nesting structure, parity-check bits p_(m) ₁ , . . . , p_(m) ₂ ⁻¹ can be obtained from H₁ ^((2), H) ₂ ⁽ ²), the systematic bits s, and the previously computed parity-check bits p₀, p₁, . . . , p_(m) ₁ ⁻¹ using the encoding techniques of equations (5) and (6). Code 3 has a parity-check matrix H⁽³⁾ defined by

$\begin{matrix} {{H^{(3)} = \begin{bmatrix} \begin{matrix} \begin{matrix} H_{1}^{(1)} & H_{2}^{(1)} \end{matrix} & 0 \\ H_{1}^{(2)} & H_{2}^{(2)} \end{matrix} & 0 \\ H_{1}^{(3)} & H_{2}^{(3)} \end{bmatrix}},} & (9) \end{matrix}$ where H₁ ⁽³⁾ is an (m₃−m₂)-by-(k+m₂) matrix, H₂ ⁽³⁾ is an (m₃−m₂)-by-(m₃−m₂) matrix whose structure can follow equation (3), and Code 3 produces parity-check bits p₀, p₁, . . . , p_(m) ₃ ⁻¹. Due to the nesting structure, parity-check bits p_(m) ₂ , . . . , p_(m) ₃ ₌₁ can be obtained from H₁ ⁽³⁾, H₂ ⁽³⁾, the systematic bits s, and the previously computed parity-check bits p₀, p₁, . . . , p_(m) ₂ ⁻¹ using the encoding techniques of equations (5) and (6). It should be noted that, like H, both H⁽²⁾ and H⁽³⁾ comprise a deterministic section having a first column having an odd weight greater than 2, and having all remaining columns comprise a 1 for i=j and a 1 for i=j+1, and 0 elsewhere, for row i, column j, 0≦i≦m−1, 0≦j≦m−2, as illustrated in (3).

The “mother code” defined in equation (9) effectively defines codes of three different rates: k/(k+m₁), k/(k+m₂), and k/(k+m₃). The three pieces ([s, p₀, p₁, . . . p_(m) ₁ ⁻¹], [s, p₀, p₁, . . . , p_(m) ₂ ⁻¹], and [s, p₀, p₁, . . . , p_(m) ₃ ⁻¹]) are then used for different transmission/reception code rates, and because they are rate-compatible, can be used for incremental redundancy (IR). In IR, a first transmission may send [s, p₀, p₁, . . . , p_(m) ₁ ⁻¹], a second transmission may send [p_(m) ₁ , . . . , p_(m) ₂ ⁻¹]), and a third transmission may send [p_(m) ₂ , . . . , p_(m) ₃ ⁻¹]. Transmissions beyond the first may be sent if earlier transmissions failed (was not received or was decoded incorrectly), or if the protocol specifies multiple transmissions. Although the discussion above assumes transmitting additional parity bits of code 2, code 3, . . . , etc., it is understood by those skilled in the art that other modes of transmission are possible. For example, when the first transmission fails, the second transmission may send additional parity bits of both code 2 and code 3, [p_(m) ₁ , . . . , p_(m) ₃ ⁻¹].

In the following, an example presented to show how the new parity-check bits for code 2 can be generated from the information and parity-check bits of code 1. To illustrate this property, define k=9, m₁=9, m₂=13, the m₁-by-(k+m₁) matrix

$\begin{matrix} {H^{(1)} = \begin{bmatrix} \begin{matrix} 1 & 0 & 0 & 0 & 0 & 1 & 0 & 0 & 0 \\ 0 & 1 & 0 & 0 & 0 & 0 & 1 & 0 & 0 \\ 0 & 0 & 1 & 0 & 0 & 0 & 0 & 1 & 0 \\ 0 & 0 & 0 & 1 & 0 & 0 & 0 & 0 & 1 \\ 0 & 0 & 0 & 0 & 1 & 0 & 0 & 0 & 0 \\ 1 & 0 & 0 & 0 & 1 & 0 & 0 & 0 & 0 \\ 0 & 1 & 0 & 0 & 0 & 1 & 0 & 0 & 0 \\ 0 & 0 & 1 & 0 & 0 & 0 & 1 & 0 & 0 \\ 0 & 0 & 0 & 1 & 1 & 0 & 1 & 1 & 1 \end{matrix} & \begin{matrix} 1 & 1 & 0 & 0 & 0 & 0 & 0 & 0 & 0 \\ 0 & 1 & 1 & 0 & 0 & 0 & 0 & 0 & 0 \\ 0 & 0 & 1 & 1 & 0 & 0 & 0 & 0 & 0 \\ 1 & 0 & 0 & 1 & 1 & 0 & 0 & 0 & 0 \\ 0 & 0 & 0 & 0 & 1 & 1 & 0 & 0 & 0 \\ 0 & 0 & 0 & 0 & 0 & 1 & 1 & 0 & 0 \\ 1 & 0 & 0 & 0 & 0 & 0 & 1 & 1 & 0 \\ 0 & 0 & 0 & 0 & 0 & 0 & 0 & 1 & 1 \\ 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 1 \end{matrix} \end{bmatrix}} \\ {= \begin{bmatrix} H_{1}^{(1)} & H_{2}^{(1)} \end{bmatrix}} \end{matrix}$ and the m₂-by-(k+m₂) matrix

$\begin{matrix} {H^{(2)} = \begin{bmatrix} H^{(1)} & \begin{matrix} 0 & 0 & 0 & 0 \\ 0 & 0 & 0 & 0 \\ 0 & 0 & 0 & 0 \\ 0 & 0 & 0 & 0 \\ 0 & 0 & 0 & 0 \\ 0 & 0 & 0 & 0 \\ 0 & 0 & 0 & 0 \\ 0 & 0 & 0 & 0 \\ 0 & 0 & 0 & 0 \end{matrix} \\ \begin{matrix} 0 & 0 & 0 & 0 & 1 & 0 & 0 & 0 & 1 & 0 & 0 & 0 & 0 & 0 & 1 & 0 & 1 & 1 \\ 0 & 0 & 0 & 0 & 0 & 1 & 0 & 0 & 0 & 0 & 0 & 1 & 0 & 0 & 0 & 0 & 1 & 0 \\ 0 & 0 & 0 & 0 & 0 & 0 & 1 & 0 & 0 & 0 & 1 & 0 & 1 & 0 & 0 & 1 & 0 & 0 \\ 0 & 0 & 0 & 0 & 0 & 0 & 0 & 1 & 0 & 1 & 0 & 0 & 0 & 1 & 1 & 1 & 0 & 0 \end{matrix} & \begin{matrix} 1 & 1 & 0 & 0 \\ 0 & 1 & 1 & 0 \\ 1 & 0 & 1 & 1 \\ 1 & 0 & 0 & 1 \end{matrix} \end{bmatrix}} \\ {= \begin{bmatrix} \begin{matrix} H_{1}^{(1)} & H_{2}^{(1)} \end{matrix} & 0 \\ H_{1}^{(2)} & H_{2}^{(2)} \end{bmatrix}} \end{matrix}\quad$

Assume that the parity-check bits p₀ through p_(m) ₁ ⁻¹ (=p₈), are already computed. Computing p_(m) ₁ , . . . , p_(m) ₂ ⁻¹ can use the encoding techniques of equations (5) and (6) as follows:

Compute

${{\sum\limits_{row}H_{1}^{(2)}} = {{{\begin{bmatrix} 0 & 0 & 0 & 0 & 1 & 1 & 1 & 1 & 1 & 1 & 1 & 1 & 1 & 1 & 0 & 0 & 0 & 1 \end{bmatrix}.{Then}}\mspace{14mu} p_{m_{1}}} = {p_{9} = {{\sum\limits_{row}{\left\lbrack H_{1}^{(2)} \right\rbrack\begin{bmatrix} s^{T} \\ p_{0} \\ \vdots \\ p_{m_{1} - 1} \end{bmatrix}}} = {s_{4} + s_{5} + s_{6} + s_{7} + s_{8} + p_{0} + p_{1} + p_{2} + p_{3} + p_{4} + p_{8}}}}}},{p_{10} = {{{{{row}_{0}\left( H_{1}^{(2)} \right)}\begin{bmatrix} s^{T} \\ p_{0} \\ \vdots \\ p_{m_{1} - 1} \end{bmatrix}} + p_{9}} = {s_{4} + s_{8} + p_{5} + p_{7} + p_{8} + p_{9}}}},{p_{11} = {{{{{row}_{1}\left( H_{1}^{(2)} \right)}\begin{bmatrix} s^{T} \\ p_{0} \\ \vdots \\ p_{m_{1} - 1} \end{bmatrix}} + p_{10}} = {s_{5} + p_{2} + p_{7} + p_{10}}}},{p_{12} = {{{{{row}_{2}\left( H_{1}^{(2)} \right)}\begin{bmatrix} s^{T} \\ p_{0} \\ \vdots \\ p_{m_{1} - 1} \end{bmatrix}} + p_{11} + p_{9}} = {s_{6} + p_{1} + p_{3} + p_{6} + p_{11} + p_{9}}}},$ where the function row_(i)(H) selects the i-th row of matrix H. Although the preferred method is presented above for finding p_(m) ₁ , other similar methods are possible. For example, it can also be found by

$p_{m_{1}} = {{\left( {\sum\limits_{row}\begin{bmatrix} \begin{matrix} H_{1}^{(1)} & H_{2}^{(1)} \end{matrix} \\ H_{1}^{(2)} \end{bmatrix}} \right)\begin{bmatrix} s^{T} \\ p_{0} \\ \vdots \\ p_{m_{1} - 1} \end{bmatrix}}.}$

As shown above, once the first parity-check bits for matrix H of the first code are transmitted, and if it has been determined that the first transmission has failed, additional parity-check bits (p_(m), . . . , p_(m) ₂ ⁻¹) can be computed and transmitted based on a current symbol set s=(s₀, . . . , s_(k−1)) and the first parity-check bits (p₀, . . . , p_(m−1)). Matrix H⁽²⁾ is used to determine the additional parity-check bits wherein H⁽²⁾ is based on H as shown in equation (8). This process may continue indefinitely. Thus during operation, microprocessor 101 exploits the structure of H to compute the m parity-check bits based on equations (5) and (6). As additional parity-check bits are needed, they are computed using matrices defined above with reference to equations (8) and (9). Again, recall that H⁽¹⁾=H and m₁=m.

FIG. 3 is a flow chart showing the operation of encoder 100, and in particular, microprocessor 101. The logic flow begins at step 301 where a current symbol set (s₀, . . . , s_(k−1)) is received. At step 303, values for first parity-check bits are determined based on H. In particular, the first parity-check bits (p₀, . . . , p_(m−1)) are determined as described above in equations (5) and (6). At step 305 the current symbol set and the first parity-check bits are transmitted. At step 307 a determination is made as to whether any additional parity-check bits need to be transmitted. This determination may be made, for example, if the first transmission failed (was not received or was decoded incorrectly), or if the transmission protocol always specifies a second transmission. If, at step 307 it is determined that additional parity-check bits need to be transmitted, then the logic flow continues to step 309 where the additional parity-check bits are determined based on an appropriate H⁽²⁾, H⁽³⁾, . . . , etc. The choice of sending parity-check bits of H⁽²⁾, H⁽³⁾. . . , etc may be based on, for example, transmission protocol, quality metrics, etc. At step 311, the additional parity-check bits are transmitted and the logic flow returns to step 307. If, at step 307 it is determined that no additional parity-check bits need to be transmitted, then the logic flow ends at step 313.

FIG. 4 is a flow chart showing the operation of decoder 200, and in particular, microprocessor 201. The logic flow begins at step 401 where the received signal vector y=(y₀, . . . , y_(n−1)) is received. At step 403, estimates of the information block s (i.e., the current symbol set (s₀, . . . , s_(k−1))) are determined based on H. As is well known in the art, there are many ways the decoder 200 can use the parity-check matrix H in the microprocessor 201 for decoding. One such way is to perform a vector-matrix multiplication with H to determine a likely error pattern. Another such way is to use H to construct a graph where the edges in the graph correspond to the 1's of H, and to iteratively process y on the graph. At step 407 a determination is made as to whether additional parity-check bits will be received, with the additional parity-check bits received in the form of an additional received signal vector of the additional parity-check bits passed through a noisy channel. This determination may be made, for example, if the first transmission failed (was not received or decoded correctly), or if the transmission protocol always specifies an additional transmission. If, at step 407 it is determined that additional parity-check bits will be received, then the logic flow continues to step 409 where the estimates of the information block s (i.e., the current symbol set (s₀, . . . , s_(k−1))) are determined based on an appropriate H⁽²⁾, H⁽³⁾, . . . , etc. and the received additional parity check bits. Logic flow then returns to step 407. If, at step 407 it is determined that no additional parity-check bits will be received, then the logic flow ends at step 413.

While the invention has been particularly shown and described with reference to a particular embodiment, it will be understood by those skilled in the art that various changes in form and details may be made therein without departing from the spirit and scope of the invention. For example, while the invention has been shown with the ordering of s_(i) and p_(i) within x defined, one of ordinary skill in the art will recognize that other ordering of the bits within x can occur since the codeword bits can be collected in any order as long as the columns of H are reordered accordingly. Additionally, while the above-description has been particularly shown and described with reference to binary codes (i.e., codes defined over the Galois Field GF(2)), one of ordinary skill in the art will recognize that an arbitrary GF may be utilized as well. Although the examples given above are shown in one format, other formats are possible which allow similar encoding and code modification procedure. For example, the column h may be located in any column of H₂, not just the first column. In another example, the bits of x may be permuted, requiring permutation of the columns of H. In yet another example, the rows of H may be permuted, without affecting the value of the parity-check bits. The matrix H may also be used in any type of decoder that relies upon a parity-check matrix. It is intended that such changes come within the scope of the following claims. 

1. A method for operating a transmitter that generates parity-check bits (p₀, . . . , p_(m−1)) based on a current symbol set s=(s₀, . . . , s_(k−1)), the method comprising the steps of: receiving the current symbol set s=(s₀, . . . , s_(k−1)); using a matrix H to determine the parity-check bits, wherein H comprises a non-deterministic section H₁ and a deterministic section H₂, and wherein H₂ comprises a first part comprising a column h having an odd weight greater than 2, and a second part comprising matrix elements for row i, column j equal to 1 for i=j, 1 for i=j+1, 0 elsewhere; and transmitting the parity-check bits along with the current symbol set.
 2. The method of claim 1 wherein: $\begin{matrix} {H_{2} = \left\lbrack {h\mspace{20mu} H_{2}^{\prime}} \right\rbrack} \\ {= \begin{bmatrix} h_{0} & 1 & \; & \; & \; & \; & \; & \; & \; & \; & \; & \; \\ h_{1} & 1 & 1 & \; & \; & \; & \; & \; & \; & \; & \; & \; \\ \vdots & \; & 1 & 1 & \; & \; & \; & 0 & \; & \; & \; & \; \\ \vdots & \; & \; & 1 & 1 & \; & \; & \; & \; & \; & \; & \; \\ \vdots & \; & \; & \; & 1 & 1 & \; & \; & \; & \; & \; & \; \\ \vdots & \; & \; & \; & \; & 1 & 1 & \; & \; & \; & \; & \; \\ \vdots & \; & \; & 0 & \; & \; & 1 & 1 & \; & \; & \; & \; \\ \vdots & \; & \; & \; & \; & \; & \; & 1 & 1 & \; & \; & \; \\ \vdots & \; & \; & \; & \; & \; & \; & \; & ⋰ & ⋰ & \; & \; \\ \vdots & \; & \; & \; & \; & \; & \; & \; & \; & 1 & 1 & \; \\ \vdots & \; & \; & \; & \; & \; & \; & \; & \; & \; & 1 & 1 \\ h_{m - 1} & \; & \; & \; & \; & \; & \; & \; & \; & \; & \; & 1 \end{bmatrix}} \end{matrix}.$
 3. The method of claim 1 wherein the step of using matrix H to determine the parity-check bits (p₀, p₁, . . . , p_(m−1)) comprises the step of determining ${p_{0} = {\left( {\sum\limits_{row}H_{1}} \right)s^{T}}},$ where $\sum\limits_{row}H_{1}$ denotes the row vector after summing up all rows of H₁.
 4. The method of claim 1 wherein the step of using matrix H to determine the parity-check bits (p₀, p₁, . . . , p_(m−1)) comprises the step of determining ${p_{0} = {\left( {\sum\limits_{row}H_{1}} \right)s^{T}}},$ where $\sum\limits_{row}H_{1}$ denotes the row vector after summing up all rows of H₁ and determining p₁, . . . , p_(m−1) recursively via p ₁ =h ₀ p ₀ +v ₀, p ₂ =h ₁ p ₀ +p ₁ +v ₁, p ₃ =h ₂ p ₀ +p ₂ +v ₂, . . . p _(m−1) =h _(m−2) p ₀ +p _(m−2) +v _(m−2) where v=[v₀, v₁, . . . , v_(m−1)]^(T)=H₁s^(T).
 5. The method of claim 1 wherein the step of using matrix H to determine the parity-check bits (p₀, p₁, . . . , p_(m−1)) comprises the step of determining ${p_{0} = {\left( {\sum\limits_{row}H_{1}} \right)s^{T}}},$ where $\sum\limits_{row}H_{1}$ denotes a row vector after summing up all rows of H₁ and determining p₁, . . . , p_(m−1) recursively.
 6. The method of claim 1 further comprising the step of: determining additional parity-check bits need to be transmitted; and transmitting the additional parity-check bits (p_(m), . . . , p_(m) ₂ ⁻¹) based on the current symbol set s=(s₀, . . . , s_(k−1)) and (p₀, . . . , p_(m−1)).
 7. The method of claim 6 further comprising the step of using a matrix H⁽²⁾ to determine the additional parity-check bits wherein H⁽²⁾ is based on H.
 8. The method of claim 7 wherein H⁽²⁾ comprises a deterministic section H₂ ⁽²⁾, wherein H₂ ⁽²⁾ comprises a first column h⁽²⁾ having an odd weight greater than 2, and a second part comprising matrix elements for row i, column j equal to 1 for i=j, 1 for i=j+1, 0 elsewhere.
 9. A method for operating a receiver that estimates a current symbol set s=(s₀, . . . , s_(k−1)), the method comprising the steps of: receiving a received signal vector y=(y₀ . . . y_(n−1)); and using a matrix H to estimate the current symbol set (s₀, . . . , s_(k−1)), wherein H comprises a non-deterministic section H₁ and a deterministic section H₂, and wherein H₂ comprises a first part comprising a column h having an odd weight greater than 2, and a second part comprising matrix elements for row i, column j equal to 1 for i=j, 1 for i=j+1, 0 elsewhere.
 10. The method of claim 9 wherein: $\begin{matrix} {H_{2} = \left\lbrack {h\mspace{20mu} H_{2}^{\prime}} \right\rbrack} \\ {= {\begin{bmatrix} h_{0} & 1 & \; & \; & \; & \; & \; & \; & \; & \; & \; & \; \\ h_{1} & 1 & 1 & \; & \; & \; & \; & \; & \; & \; & \; & \; \\ \vdots & \; & 1 & 1 & \; & \; & \; & 0 & \; & \; & \; & \; \\ \vdots & \; & \; & 1 & 1 & \; & \; & \; & \; & \; & \; & \; \\ \vdots & \; & \; & \; & 1 & 1 & \; & \; & \; & \; & \; & \; \\ \vdots & \; & \; & \; & \; & 1 & 1 & \; & \; & \; & \; & \; \\ \vdots & \; & \; & 0 & \; & \; & 1 & 1 & \; & \; & \; & \; \\ \vdots & \; & \; & \; & \; & \; & \; & 1 & 1 & \; & \; & \; \\ \vdots & \; & \; & \; & \; & \; & \; & \; & ⋰ & ⋰ & \; & \; \\ \vdots & \; & \; & \; & \; & \; & \; & \; & \; & 1 & 1 & \; \\ \vdots & \; & \; & \; & \; & \; & \; & \; & \; & \; & 1 & 1 \\ h_{m - 1} & \; & \; & \; & \; & \; & \; & \; & \; & \; & \; & 1 \end{bmatrix}.}} \end{matrix}$
 11. The method of claim 9 further comprising the step of: determining that additional parity-check bits will be received; and using the received additional parity-check bits to estimate the current symbol set (s₀, . . . , s_(k−1)).
 12. The method of claim 9 further comprising the step of: using a matrix H⁽²⁾ to determine the current symbol set (s₀, . . . , s_(k−1)), wherein H⁽²⁾ is based on H.
 13. The method of claim 12 wherein H⁽²⁾ comprises a deterministic section H₂ ⁽²⁾, wherein H₂ ⁽²⁾ comprises a first column h⁽²⁾ having an odd weight greater than 2, and a second part comprising matrix elements for row i, column j equal to 1 for i=j, 1 for i=j+1, 0 elsewhere.
 14. An apparatus comprising: storage means for storing a matrix H; a microprocessor using a matrix H to determine parity-check bits, wherein H comprises a non-deterministic section H₁ and a deterministic section H₂, and wherein H₂ comprises a first part comprising a column h having an odd weight greater than 2, and a second part comprising matrix elements for row i, column j equal to 1 for i=j, 1 for i=j+1, 0 elsewhere; and a transmitter for transmitting the parity-check bits.
 15. The apparatus of claim 14 wherein $\begin{matrix} {H_{2} = \left\lbrack {h\mspace{20mu} H_{2}^{\prime}} \right\rbrack} \\ {= \begin{bmatrix} h_{0} & 1 & \; & \; & \; & \; & \; & \; & \; & \; & \; & \; \\ h_{1} & 1 & 1 & \; & \; & \; & \; & \; & \; & \; & \; & \; \\ \vdots & \; & 1 & 1 & \; & \; & \; & 0 & \; & \; & \; & \; \\ \vdots & \; & \; & 1 & 1 & \; & \; & \; & \; & \; & \; & \; \\ \vdots & \; & \; & \; & 1 & 1 & \; & \; & \; & \; & \; & \; \\ \vdots & \; & \; & \; & \; & 1 & 1 & \; & \; & \; & \; & \; \\ \vdots & \; & \; & 0 & \; & \; & 1 & 1 & \; & \; & \; & \; \\ \vdots & \; & \; & \; & \; & \; & \; & 1 & 1 & \; & \; & \; \\ \vdots & \; & \; & \; & \; & \; & \; & \; & ⋰ & ⋰ & \; & \; \\ \vdots & \; & \; & \; & \; & \; & \; & \; & \; & 1 & 1 & \; \\ \vdots & \; & \; & \; & \; & \; & \; & \; & \; & \; & 1 & 1 \\ h_{m - 1} & \; & \; & \; & \; & \; & \; & \; & \; & \; & \; & 1 \end{bmatrix}} \end{matrix}.$
 16. The apparatus of claim 14 wherein the parity-check bits are determined by firstly determining ${p_{0} = {\left( {\sum\limits_{row}H_{1}} \right)s^{T}}},$ where $\sum\limits_{row}H_{1}$ denotes the row vector after summing up all rows of H₁.
 17. The apparatus of claim 14 wherein the parity-check bits are determined by firstly determining ${p_{0} = {\left( {\sum\limits_{row}H_{1}} \right)\; s^{T}}},$ where $\sum\limits_{row}H_{1}$ denotes the row vector after summing up all rows of H₁, and then recursively determining p₁, . . . , p_(m−1) via p ₁ =h ₀ p ₀ +v ₀, p ₂ =h ₁ p ₀ +p ₁ +v ₁, p ₃ =h ₂ p ₀ +p ₂ +v ₂, . . . p _(m−1) =h _(m−2) p ₀ +p _(m−2) +v _(m−2) where v=[v₀, v₁, . . . , v_(m−1)]^(T)=H₁s^(T).
 18. An apparatus comprising: storage means for storing a matrix H; a receiver for receiving a signal vector y=(y₀. . . y_(n−1)); and a microprocessor using a matrix H to determine a current symbol set (s₀, . . . , s_(k−1)), wherein H comprises a non-deterministic section H₁ and a deterministic section H₂, and wherein H₂ comprises a first part comprising a column h having an odd weight greater than 2, and a second part comprising matrix elements for row i, column j equal to 1 for i=j, 1 for i=j+1, 0 elsewhere.
 19. The apparatus of claim 18 wherein $\begin{matrix} {H_{2} = \begin{bmatrix} h & H_{2}^{\prime} \end{bmatrix}} \\ {= {\begin{bmatrix} h_{0} & 1 & \; & \; & \; & \; & \; & \; & \; & \mspace{11mu} & \; & \; \\ h_{1} & 1 & 1 & \; & \; & \; & \; & \; & \; & \; & \mspace{11mu} & \; \\ . & \; & 1 & 1 & \; & \; & \; & 0 & \; & \; & \; & \; \\ . & \; & \; & 1 & 1 & \; & \; & \; & \; & \; & \; & \; \\ . & \; & \; & \; & 1 & 1 & \; & \; & \; & \; & \; & \; \\ . & \; & \; & \; & \; & 1 & 1 & \; & \; & \; & \; & \; \\ . & \; & \; & 0 & \; & \; & 1 & 1 & \; & \; & \; & \; \\ . & \; & \; & \; & \; & \; & \; & 1 & 1 & \; & \; & \; \\ . & \; & \; & \; & \; & \; & \; & \; & ⋰ & ⋰ & \; & \; \\ \; & \; & \; & \; & \; & \; & \; & \; & \; & 1 & 1 & \; \\ . & \; & \; & \; & \; & \; & \; & \; & \; & \; & 1 & 1 \\ h_{m - 1} & \; & \; & \; & \; & \; & \; & \; & \; & \; & \; & 1 \end{bmatrix}.}} \end{matrix}$ 